step length造句
例句與造句
- decreasing gradient optimization algorithm with variable step length based on chaotic variables
基于混沌變量的變步長梯度下降優(yōu)化算法 - the second, a step length of rectifying judgment matrix is got through measure matrix
每次修改判斷矩陣的一對(duì)元素即可進(jìn)行判斷矩陣的修正。 - relationship between walking speed and step length and walking rate in hemiparetic stroke patients
腦卒中偏癱患者步行速度與步長和步頻的關(guān)系 - it is also proved that the step length after subsection is less than or equal to one pixel unit, so the curves drawn are equally smooth
而且可以證明分段后所繪制曲線的步長小于等于一個(gè)象素，這樣就保證了分段后所繪制曲線的平滑。 - the control process of automatic focus is analyzed in detail, and the idea of step length changing gradually is presented to increase the control precision of the system
詳細(xì)分析了自動(dòng)調(diào)焦的控制過程，并提出了漸變步長的思想，提高了系統(tǒng)的控制精度。 - It's difficult to find step length in a sentence. 用step length造句挺難的
- when one of the intermediate speed switches is selected, isc adjusting switch can be used to control the engine speed . the engine speed increases or decreases by certain step length
柴油機(jī)的轉(zhuǎn)速在某一個(gè)中速開關(guān)轉(zhuǎn)速基礎(chǔ)上用isc調(diào)整開關(guān)控制，柴油機(jī)的轉(zhuǎn)速可按一定步長遞增或遞減。 - the character of the model is to make multi-intersections, which are kept into the optimized scope in each step, use the same step length, thus finishing adding bandwidth optimization one time
模型的特點(diǎn)是每一步納入優(yōu)化范圍的多個(gè)交叉口使用同一步長，一次完成增加全系統(tǒng)帶寬的優(yōu)化。 - when step length does not satisfy the restriction condition, the original restriction condition and the optimized scope are kept, and then the step length is minimized to is to enter the second level optimization to get the optimized design plan
當(dāng)某一步的優(yōu)化步長不滿足約束條件時(shí)，保持原有約束條件和最后一步的優(yōu)化范圍，將步長降至15進(jìn)入第2層優(yōu)化獲得最優(yōu)設(shè)計(jì)方案。 - when step length does not satisfy the restriction condition, the original restriction condition and the optimized scope are kept, and then the step length is minimized to is to enter the second level optimization to get the optimized design plan
當(dāng)某一步的優(yōu)化步長不滿足約束條件時(shí)，保持原有約束條件和最后一步的優(yōu)化范圍，將步長降至15進(jìn)入第2層優(yōu)化獲得最優(yōu)設(shè)計(jì)方案。 - this paper builds the objective function of bandwidth about split, the restriction condition and the two-level optimized path based on bandwidth model, and decides optimized object, scope and step length of each step in the first level
摘要在基于帶寬模型下建立通過帶寬度關(guān)于綠信比的目標(biāo)函數(shù)和約束條件及二層優(yōu)化路徑，通過計(jì)算來確定第1層每一步優(yōu)化對(duì)象、范圍和優(yōu)化步長。 - this thesis presents the acquisition method of synchronization codes and time mark codes under-20db gaussian channel . then the total step length between initial state and current state can be calculated . basing on the step length, we can deduce the current state of pseudo-random codes, and implement the acquisition of the special pseudo-random codes
本文設(shè)計(jì)出時(shí)間標(biāo)記碼在信噪比達(dá)-20dd時(shí)的捕獲方案，在此基礎(chǔ)上提出了由偽碼歷經(jīng)的狀態(tài)數(shù)，計(jì)算子碼當(dāng)前狀態(tài)的方法，從而獲得了在30秒內(nèi)完成導(dǎo)航定位衛(wèi)星信號(hào)直接捕獲的方法與實(shí)現(xiàn)方案。 - this thesis presents the acquisition method of synchronization codes and time mark codes under-20db gaussian channel . then the total step length between initial state and current state can be calculated . basing on the step length, we can deduce the current state of pseudo-random codes, and implement the acquisition of the special pseudo-random codes
本文設(shè)計(jì)出時(shí)間標(biāo)記碼在信噪比達(dá)-20dd時(shí)的捕獲方案，在此基礎(chǔ)上提出了由偽碼歷經(jīng)的狀態(tài)數(shù)，計(jì)算子碼當(dāng)前狀態(tài)的方法，從而獲得了在30秒內(nèi)完成導(dǎo)航定位衛(wèi)星信號(hào)直接捕獲的方法與實(shí)現(xiàn)方案。 - in the thesis, tracks programming of the cutting contact points are described in detail for the above two machining methods, including the key techniques of the determination of path interval and step length, the calculation of cutting contact point, and the interference disposal of the part boundaries and the island, which provide the foundation for the improve of the blades " machining efficiency and quality
本文詳細(xì)介紹了上述兩種加工方法中切觸點(diǎn)軌跡規(guī)劃問題的實(shí)現(xiàn)，其過程包括走刀行距的確定、走刀步長和切觸點(diǎn)的確定、邊界的確定和干涉處理、島嶼干涉問題的解決等關(guān)鍵技術(shù)，為提高葉片的加工效率和質(zhì)量奠定了基礎(chǔ)。 - the paper has proved the convergence of the compound of the adaptive homotopy iteration of varying step length and the newton iteraction, and improved the result of [ 18 ] the algorithm has a powerful adaptive capacity with " homotopy " and " net grid "-two-adjusting-method
本算法的主要特點(diǎn)是自適應(yīng)能力強(qiáng)，有“同倫”和“網(wǎng)格”的雙重調(diào)控機(jī)制。這種探索性求解是本文的一種嘗試。本文證明了自適應(yīng)變步長延拓法算法與newton復(fù)合迭代的收斂性，改進(jìn)了文獻(xiàn)的結(jié)果。 - it is proved that the step length got by subsection is more than or equal to that of not subsection . so the points calculated are less than or equal to those of not subsection . thus the problem of uneven densities in generating curves is radically solved, and the algorithm is speeded up
將所需繪制的曲線按照曲線的次數(shù)分段，每段給出不同的步長，可以證明分段后每段的步長都大于或等于分段前的步長，所以實(shí)際上所計(jì)算的點(diǎn)數(shù)小于或等于不分段繪制時(shí)的點(diǎn)數(shù)，這樣就從根本上解決了曲線繪制過程中，繪制點(diǎn)疏密不均的現(xiàn)象，提高了運(yùn)行速度。
更多例句： 下一頁